On Some Finite Sums with Factorials

نویسنده

  • Branko Dragovich
چکیده

The summation formula n−1 i=0 ε i i! (i k + u k) = v k + ε n−1 n! A k−1 (n) A k−1 is a polynomial) is derived and its various aspects are considered. In particular, divisibility with respect to n is investigated. Infinitely many equivalents to Kurepa's hypothesis on the left factorial are found.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exponential Sums and Congruences with Factorials

We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials n!m! and also derive asymptotic formulas for the number of solutions of various congruences with factorials. For example, we prove that the products of two factorials n!m! with max{n,m} < p1/2+ε are uniformly distributed modulo ...

متن کامل

On Factorials Expressible as Sums of at Most Three Fibonacci Numbers

In this paper, we determine all the factorials which are a sum of at most three Fibonacci numbers.

متن کامل

The Almost Sure Convergence for Weighted Sums of Linear Negatively Dependent Random Variables

In this paper, we generalize a theorem of Shao [12] by assuming that is a sequence of linear negatively dependent random variables. Also, we extend some theorems of Chao [6] and Thrum [14]. It is shown by an elementary method that for linear negatively dependent identically random variables with finite -th absolute moment the weighted sums converge to zero as where and is an array of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004